Space time labelling technique for wireless communication systems

ABSTRACT

A space time labelling technique for wireless communication systems is provided. A transmitter for implementing the technique includes a first bit mapper and a second bit mapper which is different to the first bit mapper and first and second transmitters. A processor is connected to the first and second mappers and the first and second transmitters and controls these to receive two bit streams and simultaneously feed these into the first mapper and the second mapper. The first mapper maps these into first and second mapped bit streams and the second mapper maps these into third and fourth mapped bit streams which are different from the first and second mapper bit streams. The first mapped bit stream is transmitted in a first time slot via the first transmitter and the second mapped bit stream is transmitted in the first time slot via the second transmitter. The third mapped bit stream is transmitted in a second time slot via the second transmitter and finally the fourth mapped bit stream is transmitted in a second time slot via the first transmitter.

CROSS-REFERENCE TO RELATED APPLICATION

This application is the 35 U.S.C. § 371 national stage application of PCT Application No. PCT/IB2016/053849, filed Jun. 28, 2016, where the PCT claims priority to and the benefit of, GB Patent Application No. 1511353.3, filed Jun. 29, 2015, both of which are herein incorporated by reference in their entireties.

BACKGROUND OF THE INVENTION

This patent application relates to a wireless communication system and particularly to a space time labelling technique for wireless communication systems.

Next generation wireless communication systems demand higher data rates, spectral efficiency and link reliability. Hence, in recent years, there has been an upsurge in research regarding multiple-input multiple-output (MIMO) antenna systems to meet next generation wireless communication systems criteria. Several transmission schemes have been proposed to meet the above criteria.

However, these systems suffer high inter-channel interference (ICI) and require inter-antenna synchronisation (IAS). Furthermore, in order to achieve optimal bit error rate (BER) performance, these systems require detection schemes with high computational complexity, e.g. maximum-likelihood (ML) detection.

The present invention provides an improved wireless communication.

SUMMARY OF THE INVENTION

According to a first aspect of the invention there is provided a transmitter for a wireless communications system for implementing space-time labelling diversity for uncoded conventional modulation, the transmitter including:

-   -   a first bit mapper;     -   a second bit mapper which is different to the first bit mapper;     -   a first transmitter;     -   a second transmitter; and     -   a processor connected to the first and second mappers and the         first and second transmitters, the processor controlling these         to:         -   receive two bit streams and simultaneously feed these into             the first mapper and the second mapper, wherein the first             mapper maps these into first and second mapped bit streams             and the second mapper maps these into third and fourth             mapped bit streams which are different from the first and             second mapper bit streams;         -   transmit the first mapped bit stream in a first time slot             via the first transmitter;         -   transmit the second mapped bit stream in the first time slot             via the second transmitter;         -   transmit the third mapped bit stream in a second time slot             via the second transmitter; and         -   transmit the fourth mapped bit stream in a second time slot             via the first transmitter.

Preferably the first mapper maps the bit streams based on a conventional mapping constellation and the second mapper maps the bit streams based on placing adjacent neighbor symbols as far as possible within the constellation.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 shows a schematic drawing of a wireless communication system in accordance with an example embodiment;

FIG. 2 shows a schematic drawing of the transmitter side from FIG. 1;

FIG. 3 shows code labelling maps;

FIGS. 4 to 8 show BER performance of the present invention compared to standard Alamouti schemes;

FIG. 9 shows a schematic drawing of a receiver for use with the present invention.

DESCRIPTION OF PREFERRED EMBODIMENTS

The following explanation is for background purposes. Space-time block coding is a technique used in wireless communications to transmit multiple redundant copies of a data stream across a number of antennas and to exploit the various received versions of the data to improve the reliability of data-transfer.

The fact that the transmitted signal must traverse a potentially difficult environment with scattering, reflection, refraction and so on and may then be further corrupted by thermal noise in the receiver means that some of the received copies of the data will be ‘better’ than others. This redundancy results in a higher chance of being able to use one or more of the received copies to correctly decode the received signal. In fact, space-time coding combines all the copies of the received signal in an optimal way to extract as much information from each of them as possible.

For space-time block coding in particular, the data stream to be transmitted is encoded in blocks, which are distributed among spaced antennas and across time. While it is necessary to have multiple transmit antennas, it is not necessary to have multiple receive antennas, although to do so improves performance.

A space-time block code is usually represented by a matrix. Each row represents a time slot and each column represents one antenna's transmissions over time.

In this invention space-time block coding uses two transmitters to transmit two symbols over two consecutive time slots known as signaling intervals. In the first time slot symbol one and symbol two are simultaneously transmitted via transmit antenna one and two respectively, in the second time slot symbol two and symbol one are simultaneously transmitted via transmit antenna one and two respectively.

The idea is to minimise the probability of erroneously detecting transmitted symbols. This is achieved based on the fact that the probability that all the channels i.e. transmit antenna one and two and time slot one and two will be in deep fade is very low and hence the receiver will be able to detect the transmitted signal with fewer or no errors.

The detector on the receiver compares the received symbols to all possible transmitted pairs of symbols from the symbol set and chooses the closest pair. It is probable that the receiver might choose the wrong symbols, hence the message is erroneously detected.

The objective of space-time block coding is to minimise the probability of this error event occurring.

The present invention seeks to apply labelling diversity in addition to space-time block coding in an uncoded communications system. This is achieved via transmitting mapped symbol pairs in the second time slot. The mapped symbols contain the exact same set of symbols as in the first time slot except the positions of the symbols are modified. The criterion for arranging the set of symbols is to place adjacent neighbor symbols as far as possible, hence the probability of selecting the transmitted symbols' neighbor instead of the transmitted symbol is significantly minimised.

This overall error reduction significantly improves the reliability of the wireless communication system.

In the following description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of an embodiment of the present disclosure. It will be evident, however, to one skilled in the art that the present disclosure may be practiced without these specific details.

Referring to the accompanying Figures, an example electronic communications system is implemented as shown in FIG. 1.

The system includes a transmitter 10 and a receiver 12.

The transmitter 10 includes a first bit mapper 14 and a second bit mapper 16 which is different to the first bit mapper.

In a preferred embodiment these two bit mappers 14 and 16 use different mapping systems. For example, the first mapper maps the bit streams based on a conventional mapping constellation and the second mapper maps the bit streams based on placing adjacent neighbor symbols as far as possible within the constellation.

The transmitter 10 also includes a first transmitter 18 and a second transmitter 20. The transmitters receive baseband signals and these signals are converted up to passband signals for transmission.

Referring to FIG. 2, a processor 22 is connected to the first and second mappers 14 and 16, and the first and second transmitters 18 and 20.

The processor 22 controls the operation of the transmitter 10 as follows.

In the illustrated example, two bit streams c₁ and c₂ are received at the transmitter 10 and simultaneously fed into the first mapper 14 and the second mapper 16.

The first mapper 14 maps these input bit streams c₁ and c₂ into a first symbol x₁ and a second symbol x₂ whilst the second mapper 16 maps these two bit streams c₁ and c₂ into a third symbol {tilde over (x)}₁ and a fourth symbol {tilde over (x)}₂ which are different from the first and second symbols x₁ and x₂.

Next the processor 22 controls the transmitter 10 to transmit the first mapped bit stream x₁ in a first time slot via the first transmitter 18 and to transmit the second mapped bit stream x₂ in a second time slot via the second transmitter.

In addition, the processor 22 controls the transmitter 10 to transmit the third mapped bit stream {tilde over (x)}₁ in the first time slot via the second transmitter 20 and transmit the fourth mapped bit stream {tilde over (x)}₂ in the first time slot via the first transmitter 18.

All the mapped bit streams are transmitted out from the transmitter via antennas 24.

It will be appreciated that in this scenario the bit streams are transmitted twice wherein each transmission is effectively mapped differently and transmitted via a different transmitter in a different time slot.

These are then received at the receiver 12 via antennas 26 and unmapped.

Referring to FIG. 6, The receiver 12 is comprised of; N_(r) receive antennas 26, RF demodulator 30, channel estimator 32 and ML detector 34.

Upon reception of all the RF signals over the two consecutive time slots, the RF module 30 converts the passband signals to baseband signals which are forwarded to the ML detector 34 and the channel estimator 32. The channel estimator 32 provides the channel impulse responses which are also forwarded to the ML detector 34.

The ML detector 34 uses the channel impulse responses and the baseband signals to estimate the binary data d_(q) ₁ and d_(q) ₂ .

The wireless communication system described above thus effectively implements a Space-Time Labelling Diversity (STLD) system. The theory underpinning the described system and illustrating the advantages of this system will now be described.

The illustrated wireless communication system is a 2×N_(r) system as illustrated in FIG. 1 where N_(r) is the number of receive antennas. The fundamental idea is to transmit a mapped symbol pair in the second time slot instead of the complex conjugates transmitted in the first time slot.

The STLD system generates the 2×2 STBC based on the two mappers 14 and 16 (also ω₁ ^(M) and ω₂ ^(M) as in FIG. 1.

FIG. 3 illustrates the Gray coded labelling map ω₁ ¹⁶ and the optimised labelling map ω₂ ⁶ for 16-QAM, as well as the Gray coded labelling map ω₁ ⁶⁴ and the optimised labelling map ω₂ ⁶⁴ for 64-QAM.

A bit stream consisting of 2 log₂M random bits d=[b_(q) ₁ , b_(q) ₂ ] is fed into the STLD modulator to produce the modulated symbol pairs x₁=[x_(q) ₁ x_(q) ₂ ]^(T) and x₂=[{tilde over (x)}_(q) ₂ {tilde over (x)}_(q) ₁ ]^(T) for the first and second time slot respectively. Let (x₁, x₂) be an ordered pair and let χ_(LD) be the set that contains all the possible modulated symbols pairs (x₁,x₂), such that (x₁, x₂) ∈χ_(LD).

Based on b_(q) ₁ and b_(q) ₂ , where b_(q) ₁ =[b₁ ¹b₂ ¹ . . . b_(m) ¹], b_(q) ₂ =[b₁ ²b₂ ² . . . b_(m) ²] with m=log₂ M, the labelling map ω₁ ^(M) produces x_(q) ₁ and x_(q) ₂ , while ω₂ ^(M) produces {tilde over (x)}_(q1) and {tilde over (x)}_(q2), respectively, where x_(q) ₁ , x_(q) ₂ , {tilde over (x)}_(q) ₁ , and {tilde over (x)}_(q) ₂ belong to the an M-QAM constellation set X, with q₁, q₂ ∈[1:M²], E{|x_(q) _(i) |²}=E{|{tilde over (x)}_(q) _(i) |²}=1 and i∈[1:2]. As an example of the mapping, modulated symbol pairs for 16-QAM are tabulated in the following table.

Modulated Symbol Pairs Input Bits x₁ x₂ 00000000 [−3 − 3j −3 − 3j]^(T) [1 + 1j 1 + 1j]^(T) 00000001 [−3 − 3j −3 − 1j]^(T) [1 + 1j −3 − 1j]^(T) 10100010 [3 + 3j −3 + 3J]^(T) [−1 − 1j −3 + 3j]^(T) 11000011 [1 − 3j −3 + j]^(T) [−3 + j 1 − 3j]^(T)

The received signal for the l^(th) time slot is expressed as: y _(l)=√{square root over (ρ/2)}H _(l) x _(l) +n _(l) ,l∈1,2  (1)

where y_(l)=[y_(1,l) y_(2,l) . . . y_(N) _(T) _(,l)]^(T) is the N_(r)×1 dimensional received signal vector, n_(l)=[n_(1,l) n_(2,l) . . . n_(N) _(r) _(l)]^(T) is the N_(r)×1 dimensional additive white Gaussian noise (AWGN) vector.

The channel H_(l) is an N_(r)×2 channel matrix modeled as a frequency-flat fading Rayleigh channel, where the channel gains remain constant during a time slot, but assume independent values from one time slot to another with H_(l)=[h₁ ^(l)h₂ ^(l)] and h_(i) ^(l)=h_(l)=[h_(1,l) h_(2,l) . . . h_(N) _(T) _(,l)]^(T), i∈[1:2], i.e. E{H₁H₂}=0 and E{h₁ ^(l)(h₂ ^(l))^(H)}=0. The entries of H_(l) and n_(l) are i.i.d according to the complex Gaussian distribution C

(0,1). The factor 2 in √{square root over (ρ/2)} is to ensure normalisation such that the average signal to noise ratio (SNR) is equally divided amongst the active transmit antennas and hence √{square root over (ρ/2)} is the average SNR at each receiver antenna.

At the receiver 12, an ML detector performs an exhaustive search over all possible M² symbol pairs. The ML detector estimates the transmitted symbol indices by minimising the following metric:

$\begin{matrix} {\left\lbrack {{\hat{q}}_{1},{\hat{q}}_{2}} \right\rbrack = {\underset{{({x_{1},x_{2}})} \in \chi_{LD}}{argmin}\left\{ {{{y_{1} - {\sqrt{\rho/2}H_{1}x_{1}}}}_{F}^{2} + {{y_{2} - {\sqrt{\rho/2}H_{2}x_{2}}}}_{F}^{2}} \right\}}} & (2) \end{matrix}$

Note that the STLD space-time block code (STLD STBC) or code word X=[x₁ x₂] and the structure of the STLD scheme is similar to that of an Alamouti scheme, however, there are three strict differences between an Alamouti scheme and STLD:

-   a. The STLD STBC is not orthogonal in general. -   b. STLD use two mappers, while the Alamouti scheme uses a single     mapper. -   c. It is assumed that the channel remains constant for a single time     slot only, unlike the assumption in the Alamouti scheme where the     channel remains constant over two consecutive time slots.

Theoretical Analysis of STLD is described below.

Dealing firstly with Pairwise Error Probability, let P(X→{circumflex over (X)}) be the unconditional pairwise-error probability (PEP) that the code word X is detected at the receiver as {circumflex over (X)}, furthermore, at high SNR, we assume that only one symbol (x_(q) ₂ ) is detected correctly, while the other symbol (x_(q) ₁ ) is erroneously detected. Based on the assumption that one symbol is fully corrected, (1) can be written as:

$\begin{matrix} {y_{1} = {{\sqrt{\frac{\rho}{2}}h_{1}^{1}} + n_{1}}} & (3) \\ {y_{2} = {{\sqrt{\frac{\rho}{2}}h_{2}^{2}{\overset{\sim}{x}}_{1}} + n_{2}}} & (4) \end{matrix}$

Hence, the PEP conditioned on H₁ and H₂ is expressed as (See Appendix A for full derivation):

$\begin{matrix} {{P\left( {{X->\left. \hat{X} \middle| H_{1} \right.},H_{2}} \right)} = {Q\left( \sqrt{{\frac{\rho}{8}{h_{1}^{1}}_{F}^{2}{{x_{{\hat{q}}_{1}} - x_{q_{1}}}}^{2}} + {\frac{\rho}{8}{h_{2}^{2}}_{F}^{2}{{{\overset{\sim}{x}}_{{\hat{q}}_{1}} - {\overset{\sim}{x}}_{q_{1}}}}^{2}}} \right)}} & (5) \end{matrix}$

where Q(δ) is the Gaussian Q-function, (3.5) can be expressed as: P(X→{circumflex over (X)}|H ₁ ,H ₂)=Q(√{square root over (k ₁ +k ₂)})  (6)

where the random variables k₁ and k₂ are central chi squared random variables with 2N_(r) degrees of freedom defined as:

$\begin{matrix} {k_{1} = {{\frac{\rho}{8}{h_{1}^{1}}_{F}^{2}{{x_{{\hat{q}}_{1}} - x_{q_{1}}}}^{2}} = {\sum\limits_{n = 1}^{2{Nr}}\alpha_{1_{n}}^{2}}}} & (7) \\ {k_{2} = {{\frac{\rho}{8}{h_{2}^{2}}_{F}^{2}{{{\overset{\sim}{x}}_{{\hat{q}}_{1}} - {\overset{\sim}{x}}_{q_{1}}}}^{2}} = {\sum\limits_{n = 1}^{2{Nr}}\alpha_{2_{n}}^{2}}}} & (8) \end{matrix}$

where α₁, α₂˜N (0, σ_(α) _(l) ²), with

$\sigma_{\alpha_{1}}^{2} = {{\frac{\rho}{8}d_{1}\mspace{14mu}{and}\mspace{14mu}\sigma_{\alpha_{2\;}}} = {\frac{\rho}{8}d_{2}}}$ and d₁=|x_({circumflex over (q)}1)−x_(q) ₁ |² and d₂=|{tilde over (x)}_({circumflex over (q)}) ₁ −{tilde over (x)}_(q) ₁ |². The PDF of k₁ and k₂ is given by:

$\begin{matrix} {{{p_{k_{l}}\left( v_{l} \right)} = \frac{v_{l}^{{Nr} - 1}e^{\frac{- v_{l}}{2\sigma_{\alpha_{l\;}}^{2}}}}{\left( {2\sigma_{\alpha_{l}}^{2}} \right)^{Nr}{\left( {{Nr} - 1} \right)!}}},{l = 1},2} & (9) \end{matrix}$

The unconditional PEP can be obtained by averaging the conditional PEP in (6) over the independent random variables k₁ and k₂ for MRC reception as shown in (10) below. P(X→{circumflex over (X)})=∫₀ ^(∞)∫₀ ^(∞) P(X→{circumflex over (X)}|H ₁ ,H ₂)p _(k) ₁ (v ₁)p _(k) ₂ (v ₂)dv ₁ dv ₂  (10)

The trapezoidal approximation to the Q(δ) function is used to simplify the above analysis. The approximation is implemented over a total of n iterations as shown in (3.11)

$\begin{matrix} {{Q(\delta)} = {\frac{1}{2\; n}\left( {{\frac{1}{2}{\exp\left( \frac{- \delta^{2}}{2} \right)}} + {\sum\limits_{c = 1}^{n - 2}\;{\exp\left( \frac{- \delta^{2}}{2\;{\sin^{2}\left( {c\;{\pi/2}n} \right)}} \right)}}} \right)}} & (11) \end{matrix}$

The final PEP can be written as

$\begin{matrix} {{P\left( X\rightarrow\hat{X} \right)} = {\frac{1}{2n}\left\lbrack {{\frac{1}{2}{M_{1}\left( \frac{1}{2} \right)}{M_{2}\left( \frac{1}{2} \right)}} + {\sum\limits_{k = 1}^{n - 1}\;{{M_{1}\left( \frac{1}{2\;{\sin^{2}\left( \frac{k\;\pi}{2n} \right)}} \right)}{M_{2}\left( \frac{1}{2\;{\sin^{2}\left( \frac{k\;\pi}{2n} \right)}} \right)}}}} \right\rbrack}} & (12) \end{matrix}$

where M_(l)(⋅) is the moment generating function (MGF) defined as (13).

$\begin{matrix} {{{M_{l}(s)} = {{\int_{0}^{\infty}{e^{- {sv}_{l}}\frac{v_{l}^{{Nr} - 1}e^{\frac{- v_{l}}{2\;\sigma_{\alpha_{l}^{2}}}}}{\left( {2\;\sigma_{\alpha_{l}^{2}}} \right)^{Nr}{\left( {{Nr} - 1} \right)!}}{dv}_{l}}} = \left( \frac{1}{1 + {2\;\sigma_{\alpha_{l}^{2}}s}} \right)^{N_{r}}}},{l = 1},2} & (13) \end{matrix}$

At high SNR, (3.12) can be further approximated as,

$\begin{matrix} {{P\left( X\rightarrow\hat{X} \right)} \approx {\frac{1}{2n}\left\lbrack {{\frac{1}{2}\left( {d_{1}d_{2}\frac{\rho^{2}}{64}} \right)^{- N_{r}}} + {\sum\limits_{k = 1}^{n - 1}\left( {d_{1}{d_{2}\left( \frac{\rho}{8\;{\sin^{2}\left( \frac{k\;\pi}{2n} \right)}} \right)}^{2}} \right)^{- N_{r}}}} \right\rbrack}} & (14) \end{matrix}$

It is evident from (14) that the PEP is dominated by the minimum product distance d₁d₂, hence, maximizing the minimum product distance d₁d₂ is equivalent to minimizing the PEP. Hence, the design of the two labelling mappers is based on the following rule:

$\begin{matrix} {\arg\;\max\left\{ {\min\limits_{\begin{matrix} {x_{q_{1}} \neq x_{{\hat{q}}_{1}}} \\ {{\overset{\sim}{x}}_{q_{1}} \neq {\overset{\sim}{x}}_{{\hat{q}}_{1}}} \end{matrix} \in \chi_{LD}}\left( {{{x_{{\hat{q}}_{1}} - x_{q_{1}}}}^{2}{{{\overset{\sim}{x}}_{{\hat{q}}_{1}} - {\overset{\sim}{x}}_{q_{1}}}}^{2}} \right)} \right\}} & (15) \end{matrix}$

One very effective technique is to place adjacent constellation points of mapper 1 ω₁ ^(M) (refer to FIG. 1) as far as possible through mapper 2 ω₂ ^(M), this effectively maximizes the product distance d₁d₂. The implementation of this technique for M-QAM is to group alternate diagonal pairs in each quadrant and interchange these pairs with pairs in the opposite diagonal quadrant

An example of a 1: 16-QAM labelling map is show in the two 16-QAM labelling mappers are shown in FIG. 3.1 and FIG. 3.2. Constellation points B and E are swapped with constellation points L and O, and constellation points D and G are swapped with constellation points J and M.

Assuming ML detection at the receiver, a tight closed-form upper bound on the BER for STLD can be formulated employing the PEP derived in the preceding analysis. Hence, the average BER for STLD is bounded as,

$\begin{matrix} {P_{BER} \leq {\frac{1}{Mm}{\sum\limits_{q = 1}^{M}\;{\sum\limits_{\hat{q} \neq q}^{M}\;{{N\left( {q,\hat{q}} \right)}{P\left( X_{q}\rightarrow X_{\hat{q}} \right)}}}}}} & (15) \end{matrix}$

where N(q,{circumflex over (q)}) is the number of bits in error between symbols x_(q) ₁ and x_({circumflex over (q)}) ₁ , M is the modulation order, m=log₂ M is the number of bits per symbol and P(X_(q)→X_({circumflex over (q)})) is the probability that X_(q) is erroneously detected as X_({circumflex over (q)}), based on the assumption that x_(q) ₂ is detected correctly. Substituting (3.11) into (3.15) yields the upper bound on the average BER for STLD. In the next section, the derived upper bound is evaluated and discussed.

$\begin{matrix} {P_{BER} \leq {\frac{1}{Mm}{\sum\limits_{q = 1}^{M}\;{\sum\limits_{\hat{q} \neq q}^{M}\;{{N\left( {q,\hat{q}} \right)}{\frac{1}{2n}\left\lbrack {{\frac{1}{2}\left( \frac{1}{1 + D_{q\hat{q}}} \right)^{N_{r}}\left( \frac{1}{1 + {\overset{\sim}{D}}_{q\hat{q}}} \right)^{N_{r}}} + {\sum\limits_{k = 1}^{n - 1}\;{\left( \frac{1}{1 + \frac{D_{q\hat{q}}}{s_{k}}} \right)^{N_{r}}\left( \frac{1}{1 + \frac{{\overset{\sim}{D}}_{q\hat{q}}}{s_{k}}} \right)^{N_{r}}}}} \right\rbrack}}}}}} & (16) \end{matrix}$

where N(q,{circumflex over (q)}) is the number of bits in error between symbols x_(q) ₁ and x_(q) ₂ , M is the modulation order,

${m = {\log_{2}M}},{D_{q\hat{q}} = {\frac{\rho}{8}{{x_{{\hat{q}}_{1}} - x_{q_{1}}}}^{2}}},{{\overset{\sim}{D}}_{q\hat{q}} = {\frac{\rho}{8}{{{\overset{\sim}{x}}_{{\hat{q}}_{1}} - {\overset{\sim}{x}}_{q_{1}}}}^{2}}},{S_{k} = {\sin^{2}\left( \frac{k\;\pi}{2n} \right)}}$ and n is the number of iterations for convergence (n>10).

Thus it will be appreciated that a novel space-time block coding system is proposed called Space-time labelling diversity (STLD). Moreover, the STLD STBC outperforms the BER performance of the Alamouti STBC under the same channel assumptions and conditions.

Furthermore, a design method for the labelling maps for square M-QAM and M-PSK for a 2×N_r space-time block coded system are proposed based on the product distance criteria.

Furthermore, a tight closed form union bound on the BER for STLD employing M-QAM/PSK over independent and identically distributed (i.i.d) Rayleigh frequency-flat fading channels is formulated.

APPENDIX A

Based on the assumption that one symbol is fully corrected (4) can be written as:

$\begin{matrix} {y_{1} = {{\sqrt{\frac{\rho}{2}}h_{1}^{1}x_{q_{1}}} + n_{1}}} & \left( {A{.1}} \right) \\ {y_{2} = {{\sqrt{\frac{\rho}{2}}h_{2}^{2}{\overset{\sim}{x}}_{q_{1}}} + n_{2}}} & \left( {A{.2}} \right) \end{matrix}$

The PEP conditioned on h₁ ¹ and h₂ ² is given by:

$\begin{matrix} {{P\left( {{\left. X\rightarrow\hat{X} \right.❘h_{1}^{1}},h_{2}^{2}} \right)} = {P\left( {{{y_{1} - {\sqrt{\frac{\rho}{2}}h_{1}^{1}{x_{\hat{q}}}_{1}}}}_{F}^{2} +} \right.}} & {{~~~~~~~~~~~~~~~~~~}\left( {A{.3}} \right)} \\ {{{y_{2} - {\sqrt{\frac{\rho}{2}}h_{2}^{2}{{\overset{\sim}{x}}_{\hat{q}}}_{1}}}}_{F}^{2} <} & \; \\ {{{y_{1} - {\sqrt{\frac{\rho}{2}}h_{1}^{1}{x_{q}}_{1}}}}_{F}^{2} +} & \; \\ \left. {{y_{2} - {\sqrt{\frac{\rho}{2}}h_{2}^{2}{{\overset{\sim}{x}}_{q}}_{1}}}}_{F}^{2} \right) & \; \\ {= {P\left( {{{n_{1} - {\sqrt{\frac{\rho}{2}}{h_{1}^{1}\left( {x_{{\hat{q}}_{1}} - x_{q_{1}}} \right)}}}}_{F}^{2} +} \right.}} & {\left( {A{.4}} \right)} \\ {{{n_{2} - {\sqrt{\frac{\rho}{2}}{h_{2}^{2}\left( {{\overset{\sim}{x}}_{{\hat{q}}_{1}} - {\overset{\sim}{x}}_{q_{1}}} \right)}}}}_{F}^{2} <} & \; \\ \left. {{n_{1}}_{F}^{2} + {n_{2}}_{F}^{2}} \right) & \; \end{matrix}$

Threating the square of the frobenius as a binomial and expanding likewise square:

$\begin{matrix} \begin{matrix} {= {P\left( {{{\sqrt{\frac{\rho}{2}}{h_{1}^{1}\left( {x_{{\hat{q}}_{1}} - x_{q_{1}}} \right)}}}_{F}^{2} -} \right.}} & {{~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~}\left( {A{.5}} \right)} \\ {{2\left( {n_{1},{\sqrt{\frac{\rho}{2}}{h_{1}^{1}\left( {x_{{\hat{q}}_{1}} - x_{q_{1}}} \right)}}} \right)} + {n_{1}}_{F}^{2} +} & \; \\ {{{\sqrt{\frac{\rho}{2}}{h_{2}^{2}\left( {{\overset{\sim}{x}}_{{\hat{q}}_{1}} - {\overset{\sim}{x}}_{q_{1}}} \right)}}}_{F}^{2} -} & \; \\ {\left( {n_{2},{\sqrt{\frac{\rho}{2}}{h_{2}^{2}\left( {{\overset{\sim}{x}}_{{\hat{q}}_{1}} - {\overset{\sim}{x}}_{q_{1}}} \right)}}} \right) +} & \; \\ \left. {{n_{2}}_{F}^{2} < {{n_{1}}_{F}^{2} + {n_{2}}_{F}^{2}}} \right) & \; \\ {= {P\left( {\left( {n_{1},{\sqrt{\frac{\rho}{2}}{h_{1}^{1}\left( {x_{{\hat{q}}_{1}} - x_{q_{1}}} \right)}}} \right) +} \right.}} & {\left( {A{.6}} \right)} \\ {\left( {n_{2},{\sqrt{\frac{\rho}{2}}{h_{2}^{2}\left( {{\overset{\sim}{x}}_{{\hat{q}}_{1}} - {\overset{\sim}{x}}_{q_{1}}} \right)}}} \right) >} & \; \\ \left. \frac{\begin{matrix} {{{\sqrt{\frac{\rho}{2}}{h_{1}^{1}\left( {x_{q_{1}} - x_{{\hat{q}}_{1}}} \right)}}}_{F}^{2} +} \\ {{\sqrt{\frac{\rho}{2}}{h_{2}^{2}\left( {{\overset{\sim}{x}}_{q_{1}} - {\overset{\sim}{x}}_{{\hat{q}}_{1}}} \right)}}}_{F}^{2} \end{matrix}}{2} \right) & \; \end{matrix} & \; \end{matrix}$

where,

$\left( {n_{1},{\sqrt{\frac{\rho}{2}}{h_{1}^{1}\left( {x_{{\hat{q}}_{1}} - x_{q_{1}}} \right)}}} \right)\mspace{14mu}{and}\mspace{14mu}\left( {n_{2},{\sqrt{\frac{\rho}{2}}{h_{2}^{2}\left( {{\overset{\sim}{x}}_{{\hat{q}}_{1}} - {\overset{\sim}{x}}_{q_{1}}} \right)}}} \right)$ are Gaussian random variables with zero mean and variances of,

${{\sqrt{\frac{\rho}{2}}{h_{1}^{1}\left( {x_{{\hat{q}}_{1}} - x_{q_{1}}} \right)}}}_{F}^{2}\mspace{14mu}{and}\mspace{14mu}{{\sqrt{\frac{\rho}{2}}{h_{2}^{2}\left( {{\overset{\sim}{x}}_{{\hat{q}}_{1}} - {\overset{\sim}{x}}_{q_{1}}} \right)}}}_{F}^{2}$ respectively. The sum of these Gaussian random variables results in a new Gaussian random variable with zero mean and variance given by

${{\sqrt{\frac{\rho}{2}}{h_{1}^{1}\left( {x_{{\hat{q}}_{1}} - x_{q_{1}}} \right)}}}_{F}^{2} + {{\sqrt{\frac{\rho}{2}}{h_{2}^{2}\left( {{\overset{\sim}{x}}_{{\hat{q}}_{1}} - {\overset{\sim}{x}}_{q_{1}}} \right)}}}_{F}^{2}$

We know that for a Gaussian random variable Z with zero mean and unit variance

$\begin{matrix} {\begin{matrix} {\mspace{79mu}{{P\left( {Z > z} \right)} = {\frac{1}{\sqrt{2\;\pi}}{\int_{z}^{\infty}{e^{\frac{- v}{2}}{dv}}}}}} \\ {= {Q(z)}} \end{matrix}\mspace{79mu}{{Hence},}} & \begin{matrix} \left( {A{.7}} \right) \\ \left( {A{.8}} \right) \end{matrix} \\ \begin{matrix} {{P\left( {{\left. X\rightarrow\hat{X} \right.❘h_{1}^{1}},h_{2}^{2}} \right)} = {Q\left( \frac{\begin{matrix} {{{\sqrt{\frac{\rho}{2}}{h_{1}^{1}\left( {x_{{\hat{q}}_{1}} - x_{q_{1}}} \right)}}}_{F}^{2} +} \\ {{\sqrt{\frac{\rho}{2}}{h_{2}^{2}\left( {{\overset{\sim}{x}}_{{\hat{q}}_{1}} - {\overset{\sim}{x}}_{q_{1}}} \right)}}}_{F}^{2} \end{matrix}}{2} \right.}} \\ {\frac{1}{\left. \begin{matrix} \sqrt{{{\sqrt{\frac{\rho}{2}}{h_{1}^{1}\left( {x_{{\hat{q}}_{1}} - x_{q_{1}}} \right)}}}_{F}^{2} +} \\ {{\sqrt{\frac{\rho}{2}}{h_{2}^{2}\left( {{\overset{\sim}{x}}_{{\hat{q}}_{1}} - {\overset{\sim}{x}}_{q_{1}}} \right)}}}_{F}^{2} \end{matrix} \right)}} \\ {= {Q\left( \sqrt{\frac{\rho\begin{pmatrix} {{{h_{1}^{1}\left( {x_{{\hat{q}}_{1}} - x_{q_{1}}} \right)}}_{F}^{2} +} \\ {{h_{2}^{2}\left( {{\overset{\sim}{x}}_{{\hat{q}}_{1}} - {\overset{\sim}{x}}_{q_{1}}} \right)}}_{F}^{2} \end{pmatrix}}{8}} \right.}} \end{matrix} & \begin{matrix} \left( {A{.9}} \right) \\ \left( {A{.10}} \right) \end{matrix} \end{matrix}$ 

The invention claimed is:
 1. A transmitter for a wireless communications system for implementing space-time labelling diversity for uncoded conventional modulation, the transmitter including: a first bit mapper; a second bit mapper which is different to the first bit mapper; a first transmitter; a second transmitter; and a processor connected to the first and second mappers and the first and second transmitters, the processor controlling these to: receive two bit streams and simultaneously feed these into the first mapper and the second mapper, wherein the first mapper maps these into first and second mapped bit streams and the second mapper maps these into third and fourth mapped bit streams which are different from the first and second mapper bit streams; transmit the first mapped bit stream in a first time slot via the first transmitter; transmit the second mapped bit stream in the first time slot via the second transmitter; transmit the third mapped bit stream in a second time slot via the second transmitter; and transmit the fourth mapped bit stream in a second time slot via the first transmitter.
 2. A transmitter according to claim 1 wherein the first mapper maps the bit streams based on a conventional mapping constellation and the second mapper maps the bit streams based on placing adjacent neighbor symbols as far as possible within the constellation.
 3. A transmitter according to claim 1 or claim 2 wherein the first and second transmitters receive baseband signals and converts these up to passband signals for transmission. 